Robust Optimal Sensor Planning for Occlusion Handling in Dynamic Robotic Environments

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal robust path planning in general environments

We address robust path planning for a mobile agent in a general environment by finding minimum cost source-destination paths having prescribed widths. The main result is a new approach that optimally solves the robust path planning problem using an efficient network flow formulation. Our algorithm represents a significant departure from conventional shortest-path or graph search based methods; ...

متن کامل

Path Planning for Robotic Demining : Robust Sensor - Based Coverage of Unstructured Environments

Demining and unexploded ordnance (UXO) clearance are extremely tedious and dangerous tasks. The use of robots bypasses the hazards and potentially increases the efficiency of both tasks. A first crucial step towards robotic mine/UXO clearance is to locate all the targets. This requires a path planner that generates a path to pass a detector over all points of a mine/UXO field, i.e., a planner t...

متن کامل

Path Planning for Robotic Demining: Robust Sensor-based Coverage of Unstructured Environments and Probabilistic Methods

Demining and unexploded ordnance (UXO) clearance are extremely tedious and dangerous tasks. The use of robots bypasses the hazards and potentially increases the efficiency of both tasks. A first crucial step towards robotic mine/UXO clearance is to locate all the targets. This requires a path planner that generates a path to pass a detector over all points of a mine/UXO field, i.e., a planner t...

متن کامل

Time optimal trajectory planning in dynamic environments

This paper presents a method for motion planning in dynamic environments, subject to robot dynamics and ac-tuator constraints. The time optimal trajectory is computed by rst generating an initial guess using the concept of velocity obstacle. The initial guess, computed by a global search over a tree of avoidance maneuvers, is then optimized using a dynamic optimization. This method is applicabl...

متن کامل

Optimal workload sharing for mobile robotic networks in dynamic environments

Modern technological advances make the deployment of large groups of autonomous mobile agents with on-board computing and communication capabilities increasingly feasible and attractive. In the near future, large groups of such autonomous agents will be used to perform complex tasks in dynamic environments including transportation and distribution, logistics, surveillance, search and rescue ope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Sensors Journal

سال: 2019

ISSN: 1530-437X,1558-1748,2379-9153

DOI: 10.1109/jsen.2019.2899929